The Stellar decomposition: A compact representation for simplicial complexes and beyond

نویسندگان

چکیده

We introduce the Stellar decomposition, a model for efficient topological data structures over broad range of simplicial and cell complexes. A decomposition complex is collection regions indexing complex's vertices cells such that each region has sufficient information to locally reconstruct star its vertices, i.e., incident in region's vertices. decompositions are general they can compactly represent efficiently traverse arbitrary complexes with manifold or non-manifold domain. They scalable high dimension large size, enable users easily construct tailored application-dependent using fraction memory required by corresponding global structure on complex. As concrete realization this spatially embedded complexes, we tree, which combines nested spatial tree simple tuning parameter control number region. trees exploit locality reordering vertex indices according compressing sequential ranges indices. competitive state-ofthe-art offer significant improvements conclude highlevel description several mesh processing analysis applications utilize process datasets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Stellar tree: a Compact Representation for Simplicial Complexes and Beyond

The efficient representation and management of simplicial and cell complexes is an active research topic in several fields, including geometric modeling, computer graphics, scientific visualization, and geographic data processing. In this paper, we propose the Stellar tree, a topological data structure for performing efficient topological queries on simplicial and non-simplicial complexes. We p...

متن کامل

A combinatorial decomposition of acyclic simplicial complexes

Stanley, R.P., A combinatorial decomposition of acyclic simplicial complexes, Discrete Mathematics 120 (1993) 175-182. It is proved that if d is a finite acyclic simplicial complex, then there is a subcomplex d’ c d and a bijection q:d’+d-d’ such that Fcq(F) and /q(F)-FJ=l for all FEN’. This improves an earlier result of Kalai. An immediate corollary is a characterization (first due to Kalai) o...

متن کامل

New methods for constructing shellable simplicial complexes

A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...

متن کامل

Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem

The class of simplicial decomposition (SD) schemes have shown to provide efficient tools for nonlinear network flows. When applied to the traffic assignment problem, shortest route subproblems are solved in order to generate extreme points of the polyhedron of feasible flows, and, alternately, master problems are solved over the convex hull of the generated extreme points. We review the develop...

متن کامل

Simplicial Decomposition with Disaggregated Representation for the Traac Assignment Problem

The class of simplicial decomposition (SD) schemes have shown to provide e cient tools for nonlinear network ows. When applied to the tra c assignment problem, shortest route subproblems are solved in order to generate extreme points of the polyhedron of feasible ows, and, alternately, master problems are solved over the convex hull of the generated extreme points. We review the development of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Graphics

سال: 2021

ISSN: ['0097-8493', '1873-7684']

DOI: https://doi.org/10.1016/j.cag.2021.05.002